package com.hspedu.newData.dmsxl.动态规划;
/**
 * @Author: yh
 * @description: 
 * @CreateTime: 2025-05-25 
 * @Version: 1.0
 */

public class LC674最长连续递增序列 {
    public int findLengthOfLCIS(int[] nums) {

        int[] dp = new int[nums.length];
        for (int i = 1; i < nums.length; i++) {
            if (nums[i]>nums[i-1]){
                dp[i] = Math.max(dp[i-1]+1,dp[i]);
            }
        }
        return 1;
    }
}
